Two-agent scheduling with linear resource-dependent processing times

This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms.     

基于提升的双自适应小波变换算法研究

小波变换的传统提升算法的滤波器固定，不能随输入信号的变化而改变，针对该问题，结合现有的自适应算法，提出一种双自适应小波变换算法，并对该算法的更新和预测过程进行了自适应调整。实验证明，该算法比传统的提升算法和单纯的自适应更新或自适应预测算法具有更优越的性能。     

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

AUSMPW+格式在高超声速热化学非平衡流数值模拟中的应用

将AUSMPW+格式应用到高超声速热化学非平衡流场的数值模拟中。为提高精度,采用了三阶MUSCL插值方法。与LU SGS方法结合,提高了单步计算效率和收敛性。采用热化学非平衡十一组元气体模型求解了非定常轴对称Navier Stokes方程组,得到了收敛结果。数值模拟结果与文献结果进行了对比,并在弹道靶中进行了钢质圆球的实验验证。计算结果与文献、实验的对比说明,AUSMPW+格式可以在热化学非平衡流的数值模拟中精确地捕捉到强弓形激波,得到准确的空气动力系数。     

整数DCT(BinDCT)快速算法

设计和实现了基于提升结构的无乘法二进制DCT (BinDCT)的快速算法。该算法是在基于旋转变换的递归算法基础上设计的 ,并将传统的旋转变换的 3个提升矩阵乘积减少至 2个提升矩阵乘积 ,从而使算法的运算量比现有算法大为减少     

挠性陀螺平台罗经精校状态参数设计

根据挠性陀螺平台罗经系统初始精校准的具体要求,采用控制理论中极点配置的方法,设计出初始精校准状态的参数值,并进行了计算机仿真验证。     

火箭助飞鱼雷攻潜试验方案研究

为贴近实战完成火箭助飞鱼雷攻潜试验,针对目标指示信息设备选择、目标靶的选择、射击方式解算等几个试验方案设计关键点对试验方案设计进行了分析,建立了影响攻潜效果主要因素的仿真计算模型,并给出了仿真计算结果。经海上试验检验,方案设计合理可行。     

逃逸飞行器喷流干扰流场的分区数值模拟

基于拼接网格系统 ,应用三维区域边界格式 ;通过区域边界格式对区域边界上的通量进行守恒性处理 ,发展了一个超音速复杂流场分区算法 ;对不同攻角下的逃逸飞行器喷流干扰流场进行了分区数值模拟 ,取得了较好的结果     

武器系统方案评价与决策的DEA模型

利用数据包络分析方法建立了武器系统研制方案评价与决策的新模型,设计了其评价指标体系与决策分析步骤,并给出了模型的实际应用案例